Bounded theories for polyspace computability
نویسندگان
چکیده
منابع مشابه
Finitely Bounded Effective Computability
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually...
متن کاملComputability and Physical Theories
The familiar theories o f physics have the feature that the application o f the theory to make predictions in specific circumstances can be done by means o f an algorithm. We propose a more precise formulation of this feature--one based on the issue of whether or not the physically measurable numbers predicted by the theory are computable in the mathematical sense. Applying this formulation to ...
متن کاملComputability As A Test On Linguistics Theories
Scientific theories are more than purely formal constructs, but linguistic artefacts that often rely on the rhetorical qualities of language to give their claims additional resonance and argumentative force. This reliance of theory upon language is even greater in those theoretical domains whose main concern is language itself, leading to a sometimes convenient blurring of content and form. Tho...
متن کاملTowards applied theories based on computability logic
Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, “truth” means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations fo...
متن کاملTheories for Subexponential - size Bounded - depth
This paper is a contribution to our understanding of the relationship between uniform and nonuniform proof complexity. The latter studies the lengths of proofs in various propositional proof systems such as Frege and bounded-depth Frege systems, and the former studies the strength of the corresponding logical theories such as VNC1 and V0 in [7]. A superpolynomial lower bound on the length of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Portugaliae Mathematica
سال: 2013
ISSN: 0032-5155
DOI: 10.4171/pm/1936